Trace and Norm
نویسنده
چکیده
Let L/K be a finite extension of fields, with n = [L : K]. We will associate to this extension two important functions L→ K, called the trace and the norm. For each α ∈ L, let mα : L → L be multiplication by α: mα(x) = αx for x ∈ L. Each mα is a K-linear map from L to L, so choosing a K-basis of L lets us write mα as an n×n matrix, which will be denoted [mα], or [mα]L/K if we need to emphasize the field extension that is involved. (We need to put an ordering on the basis to get a matrix, but we will often just refer to picking a basis and list it in a definite way instead of saying “pick an ordered basis”.)
منابع مشابه
A note on the Young type inequalities
In this paper, we present some refinements of the famous Young type inequality. As application of our result, we obtain some matrix inequalities for the Hilbert-Schmidt norm and the trace norm. The results obtained in this paper can be viewed as refinement of the derived results by H. Kai [Young type inequalities for matrices, J. Ea...
متن کاملExplicit bases for Riemann-Roch spaces of the extended norm-trace function field, with applications AG codes and Weierstrass semigroups
The extended norm-trace function field is a generalization of the Hermitian and norm-trace function fields which are of importance in coding theory. In this paper, we provide explicit bases for certain Riemann-Roch spaces on the extended norm-trace function field. These bases provide explicit generator and parity check matrices for algebraic geometry codes CL ( D, aP∞ + ∑ β∈B aβP0β ) on the ext...
متن کاملLearning Structure with the Trace Norm Distribution
We consider the problem of learning model structure. We assume that data is generated by one or more trace norm distributions [3]. We find that, as with other unsupervised problems, there are a number of equallycorrrect solutions. Which solution is best depends on the interpretation of distances in the data space. 1 Trace Norm Distribution Let X ∈ R. The trace norm distribution is defined as P ...
متن کاملCollaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm
We show that matrix completion with trace-norm regularization can be significantly hurt when entries of the matrix are sampled non-uniformly, but that a properly weighted version of the trace-norm regularizer works well with non-uniform sampling. We show that the weighted trace-norm regularization indeed yields significant gains on the highly non-uniformly sampled Netflix dataset.
متن کاملTrace Lasso: a trace norm regularization for correlated designs
Using the `1-norm to regularize the estimation of the parameter vector of a linear model leads to an unstable estimator when covariates are highly correlated. In this paper, we introduce a new penalty function which takes into account the correlation of the design matrix to stabilize the estimation. This norm, called the trace Lasso, uses the trace norm of the selected covariates, which is a co...
متن کاملNew trace norm inequalities for 2 × 2 blocks of diagonal matrices
Several new trace norm inequalities are established for 2n × 2n block matrices, in the special case where the four n × n blocks are diagonal. Some of the inequalities are non-commutative analogs of Hanner's inequality , others describe the behavior of the trace norm under reordering of diagonal entries of the blocks.
متن کامل